The Latent Community Model for Detecting Sybils in Social Networks
نویسندگان
چکیده
Collaborative and recommendation-based computer systems are plagued by attackers who create fake or malicious identities to gain more influence in the system— such attacks are often referred to as “Sybil attacks”. We propose a new statistical model and associated learning algorithms for detecting Sybil attacks in a collaborative network using network topology, called the latent community (LC) model. The LC model is hierarchical, and groups the nodes in a network into closely linked communities that are linked relatively loosely with the rest of the graph. Since the author of a Sybil attack will typically create many false identities and link them together in an attempt to gain influence in the network, a Sybil attack will often correspond to a learned community in the LC model. Evaluation of the LC model using both realworld and synthetic networks demonstrates the promise of the method.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملStructure-based Sybil Detection in Social Networks via Local Rule-based Propagation
Social networks are known to be vulnerable to the so-called Sybil attack, in which an attacker maintains massive Sybils and uses them to perform various malicious activities. Therefore, Sybil detection in social networks is a basic security research problem. Structure-based methods have been shown to be promising at detecting Sybils. Existing structure-based methods can be classified into two c...
متن کاملCOS 598C: Detecting overlapping communities, and theoretical frameworks for learning deep nets and dictionaries
Today we present some ideas for provable learning of deep nets and dictionaries, two important (and related) models. The common thread is a simple algorithm for detecting overlapping communities in networks. While community detection is typically thought of as a way to discover structure in, say, large social networks, here we use as a general purpose algorithmic tool to understand structure of...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملDetecting Sybils in Peer-to-Peer File Replication Systems
The test of a peer-to-peer file sharing network is how efficiently the objects are discovered and retrieved. One of the most important factors that contribute towards this is optimal replication of the objects across the network. One of the security threats to replication model is Sybil attack. In this paper we propose an approach that aims at detecting sybil identities in peer-to-peer file sha...
متن کامل